Ergodic theorems for some classical problems in combinatorial optimization

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An economic approach to some classical theorems in optimization theory

This short article offers economically intuitive proofs of the Euler equation and the maximum principle based on one of the best known results in economics, namely that the marginal utility of one extra dollar spent on each consumption goods is the same for all the consumption goods as required by budget-constrained utility maximization.

متن کامل

WEAK AND STRONG DUALITY THEOREMS FOR FUZZY CONIC OPTIMIZATION PROBLEMS

The objective of this paper is to deal with the fuzzy conic program- ming problems. The aim here is to derive weak and strong duality theorems for a general fuzzy conic programming. Toward this end, The convexity-like concept of fuzzy mappings is introduced and then a speci c ordering cone is established based on the parameterized representation of fuzzy numbers. Un- der this setting, duality t...

متن کامل

Differential Approximation Algorithms for Some Combinatorial Optimization Problems

We use a new approximation measure, the differential approximation ratio, to derive polynomial-time approximation algorithms for minimum set covering (for both weighted and unweighted cases), minimum graph coloring and bin-packing. We also propose differentialapproximation-ratio preserving reductions linking minimum coloring, minimum vertex covering by cliques, minimum edge covering by cliques ...

متن کامل

Some Problems in Proof Complexity and Combinatorial Optimization

Lovász and Schjriver [34] introduced several lift and project methods for 0-1 integer programs, now collectively known as Lovász-Schjriver (LS) hierarchies. Several lower bounds have since been proven for the rank of various linear programming relaxations in the LS hierarchy. In this paper we study lower bounds on the rank in the more general LS∗ hierarchy, which was first investigated by Grigo...

متن کامل

Some Ergodic Theorems for Random Rotations on Wiener Space

In this paper we study ergodicity and mixing property of some measure preserving transformations on the Wiener space (W, H, µ) which are generated by some random unitary operators defined on the Cameron-Martin space H.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Applied Probability

سال: 1996

ISSN: 1050-5164

DOI: 10.1214/aoap/1034968238